Efficient Approximation of Backgammon Race Equities

نویسنده

  • Michael Buro
چکیده

of Backgammon Race Equities Michael Buro NEC Research Institute 4 Independence Way Princeton NJ 08540, USA Abstract This article presents e cient equity approximations for backgammon races based on statistical analyses. In conjunction with a 1{ply search the constructed evaluation functions allow a program to play short races almost perfectly with regard to checker{play as well as doubling cube handling. Moreover, the evaluation can naturally be extended to long races without losing much accuracy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient Approximation of Backgammon Race Equities

This article presents e cient equity approximations for backgammon races based on statistical analyses. In conjunction with a 1{ply search the constructed evaluation functions allow a program to play short races almost perfectly with regard to checker{play as well as doubling cube handling. Moreover, the evaluation can naturally be extended to long races without losing much accuracy.

متن کامل

Achieving Efficient and Cognitively Plausible Learning in Backgammon

Traditionally, computer applications to game domains have taken a brute-force approach, relying on sheer computational power to overcome the complexity of the domain. Although many of these programs have been quite successful, it is interesting to note that humans can still perform extremely well against them. Thus we are compelled to ask, if no human could match the computational power of most...

متن کامل

Nannon: A Nano Backgammon for Machine Learning Research

Nannon is a copyrighted game, but may be used for research and academic purposes. Nannon is a trademark of Nannon Technology corp., which provided permission to publish the rules and board in this paper. AbstractA newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features and dy...

متن کامل

Training Neural Networks to Play Backgammon Variants Using Reinforcement Learning

Backgammon is a board game that has been studied considerably by computer scientists. Apart from standard backgammon, several yet unexplored variants of the game exist, which use the same board, number of checkers, and dice but may have different rules for moving the checkers, starting positions and movement direction. This paper studies two popular variants in Greece and neighboring countries,...

متن کامل

Efficient Optimum Design of Steructures With Reqency Response Consteraint Using High Quality Approximation

An efficient technique is presented for optimum design of structures with both natural frequency and complex frequency response constraints. The main ideals to reduce the number of dynamic analysis by introducing high quality approximation. Eigenvalues are approximated using the Rayleigh quotient. Eigenvectors are also approximated for the evaluation of eigenvalues and frequency responses. A tw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ICGA Journal

دوره 22  شماره 

صفحات  -

تاریخ انتشار 1999